A Study in Higher-Order Programming Languages MS Thesis
نویسنده
چکیده
This thesis describes some interplays between the specification and the implementation of higher-order programming languages. We first investigate a traditional implementation of Scheme (compiler, run-time machine). We then turn to Action Semantics. And finally we cross-fertilize these two approaches using both syntax-directed and type-directed partial evaluation and introducing an alternative representation of data structures.
منابع مشابه
Higher-order queries and applications
Higher-order transformations are ubiquitous within data management. In relational databases, higher-order queries appear in numerous aspects including query rewriting and query specification. In XML databases, higher-order functions are natural due to the close connection of XML query languages with functional programming. The thesis investigates higher-order query languages that combine higher...
متن کاملRealizing Concurrent Functional . . .
of “Realizing Concurrent Functional Programming Languages” by Eric Larsen McCorkle, Sc.M, Brown University, May, 2008. This thesis is concerned with a methodology for deriving parallelism from programs where there is little or no coarse–grained concurrency. It presents the case that that concurrent functional programminga paradigm formed from the assimilation of concurrent programming construct...
متن کاملExamining the Generic Features of Thesis Acknowledgments: A Case of Iranian MA Graduate Students Majoring in Teaching to Speakers of Other Languages (AZFA) and TEFL
Thesis acknowledgement is a written genre in which MA graduate students offer their gratitude to individuals, who have contributed to the completion of their study. The aim of the current study was to examine the thesis acknowledgements written by Iranian MA students in the field of Persian Language Teaching to Non-Persian Speakers (Amouzeshe Zaban e Farsi be Kharejian, AZFA) and TEFL in terms ...
متن کاملThesis Proposal (Draft)
The goal of my thesis project is to create a framework for encoding and reasoning about functional languages in the Isabelle theorem prover. The framework will encode languages using deep embeddings, with higher-order abstract syntax. The motivating test case is the GHCCore language—an explicitly-typed, desugared variant of Haskell which is used as an intermediate language by the Glasgow Haskel...
متن کاملA Functional Approach to Computability on Real Numbers
The aim of this thesis is to contribute to close the gap existing between the theory of computable analysis and actual computation. In order to study computability over real numbers we use several tools peculiar to the theory of programming languages. In particular we introduce a special kind of typed lambda calculus as an appropriate formalism for describing computations on real numbers. Furth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997